Approximation of Automorphisms of the Rationals and the Random Graph
نویسنده
چکیده
Let G be the group of order-preserving automorphisms of the rationals Q, or the group of colour-preserving automorphisms of the C-coloured random graph RC . We show that given any non-identity f ∈ G, there exists g ∈ G such that every automorphism in G is the limit of a sequence of automorphisms generated by f and g. Moreover, if, in some sense, f has no finite structure, then g can be chosen with a great deal of flexibility.
منابع مشابه
OD-characterization of $S_4(4)$ and its group of automorphisms
Let $G$ be a finite group and $pi(G)$ be the set of all prime divisors of $|G|$. The prime graph of $G$ is a simple graph $Gamma(G)$ with vertex set $pi(G)$ and two distinct vertices $p$ and $q$ in $pi(G)$ are adjacent by an edge if an only if $G$ has an element of order $pq$. In this case, we write $psim q$. Let $|G= p_1^{alpha_1}cdot p_2^{alpha_2}cdots p_k^{alpha_k}$, where $p_1
متن کاملExistence and Iterative Approximations of Solution for Generalized Yosida Approximation Operator
In this paper, we introduce and study a generalized Yosida approximation operator associated to H(·, ·)-co-accretive operator and discuss some of its properties. Using the concept of graph convergence and resolvent operator, we establish the convergence for generalized Yosida approximation operator. Also, we show an equivalence between graph convergence for H(·, ·)-co-accretive operator and gen...
متن کاملThe Role of the Scholars` Tradition in Formulating Moral Propositions, with an Emphasis on Muhaqqiq Isfahani`s View
The issue of the source of ethical value is one of the most important issues in the field of metaethics. Moral philosophers have come up with different perspectives on this issue. Some Islamic thinkers, including Muhaqqiqi Isfahani, have considered the rationals` tradition as the formulating cause for moral propositions. This research is intended to emphasize on the viewpoint of Muhaqqiqi Isfah...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملComplexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009